Probability of a pure equilibrium point in n-person games
نویسندگان
چکیده
منابع مشابه
Equilibrium Points in N - Person Games
* This note arose from consultations during the tenure of a John Simon Guggenheim Memorial Fellowship by MacLane. ' Whitehead, J. H. C., "Combinatorial Homotopy I and II," Bull. A.M.S., 55, 214-245 and 453-496 (1949). We refer to these papers as CH I and CH II, respectively. ' By a complex we shall mean a connected CW complex, as defined in §5 of CH I. We do not restrict ourselres to finite com...
متن کاملEquilibrium Points in N-Person Games.
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملA Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games
Abstract This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...
متن کاملDiscovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs
In this paper we provide a logical framework for using computers to discover theorems in two-person finite games in strategic form, and apply it to discover classes of games that have unique pure Nash equilibrium payoffs. We consider all possible classes of games that can be expressed by a conjunction of two binary clauses, and our program rediscovered Kats and Thisse’s class of weakly unilater...
متن کاملProbability CONNECTIVITY AND EQUILIBRIUM IN RANDOM GAMES
We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there are pure Nash equilibria arising when random utility tables are assigned to the players. We provide conditions for the structure of the graph under which equilibria are likely to exist and complementary cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1970
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(70)80015-1